The Universal Composable Security of Quantum Key Distribution
نویسندگان
چکیده
Institute of Computer Science, The Hebrew University, Jerusalem, Israel Institute of Theoretical Physics and Astrophysics, University of Gdańsk, Poland Institute for Quantum Information, California Institute of Technology, Pasadena, USA Mathematical Science Research Institute, Berkeley, USA Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, UK Isaac Newton Institute, University of Cambridge, Cambridge, UK
منابع مشابه
Universally Composable Privacy Amplification Against Quantum Adversaries
Privacy amplification is the art of shrinking a partially secret string Z to a highly secret key S. We show that, even if an adversary holds quantum information about the initial string Z, the key S obtained by two-universal hashing is secure, according to a universally composable security definition. Additionally, we give an asymptotically optimal lower bound on the length of the extractable k...
متن کاملComposable Privacy Amplification Against Quantum Adversaries ∗
Privacy amplification is the art of shrinking a partially secret string Z to a highly secret key S. We show that, even if an adversary holds quantum information about the initial string Z, the key S obtained by two-universal hashing is secure, according to a universally composable security definition. Additionally, we give an asymptotically optimal lower bound on the length of the extractable k...
متن کاملUniversally-composable privacy amplification from causality constraints
We consider schemes for secret key distribution which use as a resource correlations that violate Bell inequalities. We provide the first security proof for such schemes, according to the strongest notion of security, the so-called universally composable security. Our security proof does not rely on the validity of quantum mechanics, it solely relies on the impossibility of arbitrarily fast sig...
متن کاملQuantum Asymmetric-Key Cryptosystem Secure Against A Computationally Unbounded Adversary
In this paper we propose a quantum asymmetric-key cryptosystem, which does not rely on a computationally hard problem for security, but on uncertainty principles of quantum mechanics, thus obtaining security against a computationally unbounded adversary. We first propose a universally composable security criteria for quantum asymmetric-key cryptosystems by adapting the universally composable se...
متن کاملUniversally composable and customizable post-processing for practical quantum key distribution
In quantum key distribution (QKD), a secret key is generated between two distant parties by transmitting quantum states. Experimental measurements on the quantum states are then transformed to a secret key by classical postprocessing. Here, we propose a construction framework in which QKD classical post-processing can be custom made. Though seemingly obvious, the concept of concatenating classi...
متن کامل